<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    776. N-ary Tree Postorder Traversal
   </h1>
   <p>
    Given an n-ary tree, return the
    <i>
     postorder
    </i>
    traversal of its nodes' values.
   </p>
   <p>
    For example, given a
    <code>
     3-ary
    </code>
    tree:
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    <img src="https://assets.leetcode.com/uploads/2018/10/12/narytreeexample.png" style="width: 100%; max-width: 300px;">
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    Return its postorder traversal as:
    <code>
     [5,6,3,2,4,1]
    </code>
    .
   </p>
   &nbsp;
   <p>
    <b>
     Note:
    </b>
   </p>
   <p>
    Recursive solution is trivial, could you do it iteratively?
   </p>
  </div>
  <div>
   <h1 class="question_title">
    776. N叉树的后序遍历
   </h1>
   <p>
    给定一个 N 叉树，返回其节点值的
    <em>
     后序遍历
    </em>
    。
   </p>
   <p>
    例如，给定一个&nbsp;
    <code>
     3叉树
    </code>
    &nbsp;:
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    <img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/narytreeexample.png" style="width: 100%; max-width: 300px;">
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    返回其后序遍历:
    <code>
     [5,6,3,2,4,1]
    </code>
    .
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    <strong>
     说明:
    </strong>
    &nbsp;递归法很简单，你可以使用迭代法完成此题吗?
   </p>
  </div>
 </body>
</html>